Signature-Based Gröbner Basis Algorithms - Extended MMM Algorithm for computing Gröbner bases
نویسنده
چکیده
Signature-based algorithms is a popular kind of algorithms for computing Gröbner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a view of signature-based algorithms is given, that is, signature-based algorithms can be regarded as an extended version of the famous MMM algorithm. By this view, this paper aims to give an easier way to understand signature-based Gröbner basis algorithms.
منابع مشابه
Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms
Signature-based algorithms are a popular kind of algorithms for computing Gröbner basis, including the famous F5 algorithm, F5C, extended F5, GV and the GVW algorithm. In this paper, an efficient method is proposed to solve the detachability problem. The new method only uses the outputs of signature-based algorithms, and no extra Gröbner basis computations are needed. When a Gröbner basis is ob...
متن کاملOn Signature-Based Gröbner Bases Over Euclidean Rings
In this paper we present first steps in using signature-based Gröbner basis algorithms like Faugère’s F5 or GVW for computation over Euclidean rings. We present problems appearing when having to deal with coefficients and zero divisors and give practical solution techniques. A hybrid algorithm is presented trying to combine the advantages of signature-based and non-signature-based Gröbner basis...
متن کاملSignature-based Criteria for Möller's Algorithm for Computing Gröbner Bases over Principal Ideal Domains
Signature-based algorithms have become a standard approach for Gröbner basis computations for polynomial systems over fields, but how to extend these techniques to coefficients in general rings is not yet as well understood. In this paper, we present a signature-based algorithm for computing Gröbner bases over principal ideal domains (e.g. the ring of integers or the ring of univariate polynomi...
متن کاملA new conception for computing gröbner basis and its applications
This paper presents a conception for computing gröbner basis. We convert some of gröbner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm’s finite termination problem can be described by equivalent conditions, so all the above algorithms can be determined when they terminate finitely. At last, a new criterion is presented. It is ...
متن کاملA Generalized Criterion for Signature-based Algorithms to Compute Gröbner Bases
A generalized criterion for signature-based algorithms to compute Gröbner bases is proposed in this paper. This criterion is named by “generalized criterion”, because it can be specialized to almost all existing criteria for signature-based algorithms which include the famous F5 algorithm, F5C, extended F5, GV and the GVW algorithm. The main purpose of current paper is to study in theory which ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1308.2371 شماره
صفحات -
تاریخ انتشار 2013